Embedding Sun Graphs in a Single Page
نویسندگان
چکیده
منابع مشابه
Simpler Testing for Two-page Book Embedding of Partitioned Graphs
A 2-page book embedding of a graph is to place the vertices linearly on a spine (a line segment) and the edges on the two pages (two half planes sharing the spine) so that each edge is embedded in one of the pages without edge crossings. Testing whether a given graph admits a 2-page book embedding is known to be NP-complete. In this paper, we study the problem of testing whether a given graph a...
متن کاملA Linear Time Algorithm for Embedding Arbitrary Knotted Graphs into a 3-Page Book
We introduce simple codes and fast visualization tools for knotted structures in complicated molecules and brain networks. Knots, links and more general knotted graphs are studied up to an ambient isotopy in Euclidean 3-space. A knotted graph can be represented by a plane diagram or a Gauss code. First we recognize in linear time if an abstract Gauss code represents a graph embedded in 3-space....
متن کاملSpectral characterizations of sun graphs and broken sun graphs
Several matrices can be associated to a graph such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question “Which graphs are determined by their spectrum?” remains a difficult problem in algebraic graph theory. In this article we enlarge the known families of graphs determined by their spectrum by ...
متن کاملEmbedding Secret Data in HTML Web Page
In this paper, we suggest a novel data hiding technique in an Html Web page. Html Tags are case insensitive and hence an alphabet in lowercase and one in uppercase present inside an html tag are interpreted in the same manner by the browser, i.e., change in case in an web page is imperceptible to the browser. We basically exploit this redundancy and use it to embed secret data inside an web pag...
متن کاملFinding a sun in building-free graphs
Deciding whether an arbitrary graph contains a sun was recently shown to be NP-complete [10]. We show that whether a building-free graph contains a sun can be decided in O(min{mn,mn}) time and, if a sun exists, it can be found in the same time bound. The class of building-free graphs contains many interesting classes of perfect graphs such as Meyniel graphs which, in turn, contains classes such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Society for Mathematical Services and Standards
سال: 2013
ISSN: 2277-8020
DOI: 10.18052/www.scipress.com/bsmass.5.31